CO92 : combinatorial optMCDIARMID, COLIN.Discrete applied mathematics. 1995, Vol 57, Num 2-3, issn 0166-218X, 179 p.Conference Proceedings

The complexities of the coefficients of the Tutte polynomialANNAN, J. D.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 93-103, issn 0166-218XConference Paper

Stochastic scheduling and forwards inductionGLAZEBROOK, K. D.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 145-165, issn 0166-218XConference Paper

Expected complexity of graph partitioning problemsKUCERA, L.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 193-212, issn 0166-218XConference Paper

Rooted routing in the planeREED, B.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 213-227, issn 0166-218XConference Paper

Regularity of matrices in min-algebra and its time- complexityBUTKOVIC, P.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 121-132, issn 0166-218XConference Paper

On the maximum queue length in the supermarket modelLUCZAK, Malwina J; MCDIARMID, Colin.Annals of probability. 2006, Vol 34, Num 2, pp 493-527, issn 0091-1798, 35 p.Article

Graph imperfection with a co-site constraintGERKE, Stefanie; MCDIARMID, Colin.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 3, pp 403-425, issn 0895-4801, 23 p.Article

The complexity of harmonious colouring for treesEDWARDS, K; MCDIARMID, C.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 133-144, issn 0166-218XConference Paper

Weighted fractional and integral k-matching in hypergraphsSRIVASTAV, A; STANGIER, P.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 255-269, issn 0166-218XConference Paper

Uniform multicommodity flow through the complete graph with random edge-capacitiesALDOUS, David J; MCDIARMID, Colin; SCOTT, Alex et al.Operations research letters. 2009, Vol 37, Num 5, pp 299-302, issn 0167-6377, 4 p.Article

RANDOM HYPERPLANE SEARCH TREESDEVROYE, Luc; KING, James; MCDIARMID, Colin et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2411-2425, issn 0097-5397, 15 p.Article

On the span in channel assignment problems: bounds, computing and countingMCDIARMID, Colin.Discrete mathematics. 2003, Vol 266, Num 1-3, pp 387-397, issn 0012-365X, 11 p.Conference Paper

Acyclic improper colourings of graphs with bounded maximum degreeADDARIO-BERRY, Louigi; ESPERET, Louis; KANG, Ross J et al.Discrete mathematics. 2010, Vol 310, Num 2, pp 223-229, issn 0012-365X, 7 p.Conference Paper